Graph Convolutional Networks: Application to Database Completion of Wastewater Networks
نویسندگان
چکیده
Wastewater networks are mandatory for urbanisation. Their management, including the prediction and planning of repairs expansion operations, requires precise information on their underground components (manhole covers, equipment, nodes, pipes). However, due to years service increasing number maintenance operations they may have undergone over time, attributes characteristics associated with various objects constituting a network not all available at given time. This is partly because (i) multiple actors that carry out extensions necessarily operators who ensure continuous functioning network, (ii) undertaken changes properly tracked reported. Therefore, databases related wastewater suffer from missing data. To overcome this problem, we aim exploit structure in learning process machine approaches, using topology relationship between components, complete values pipes. Our results show Graph Convolutional Network (GCN) models yield better than classical methods represent useful tool data completion.
منابع مشابه
Dynamic Graph Convolutional Networks
Many different classification tasks need to manage structured data, which are usually modeled as graphs. Moreover, these graphs can be dynamic, meaning that the vertices/edges of each graph may change during time. Our goal is to jointly exploit structured data and temporal information through the use of a neural network model. To the best of our knowledge, this task has not been addressed using...
متن کاملGraph Convolutional Networks
We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions. Our model scales linearly in the number of graph edges and learns hidden lay...
متن کاملGraph Convolutional Matrix Completion
We consider matrix completion for recommender systems from the point of view of link prediction on graphs. Interaction data such as movie ratings can be represented by a bipartite user-item graph with labeled edges denoting observed ratings. Building on recent progress in deep learning on graph-structured data, we propose a graph auto-encoder framework based on differentiable message passing on...
متن کاملDistance Metric Learning Using Graph Convolutional Networks: Application to Functional Brain Networks
Evaluating similarity between graphs is of major importance in several computer vision and pattern recognition problems, where graph representations are often used to model objects or interactions between elements. The choice of a distance or similarity metric is, however, not trivial and can be highly dependent on the application at hand. In this work, we propose a novel metric learning method...
متن کاملTopology adaptive graph convolutional networks
Convolution acts as a local feature extractor in convolutional neural networks (CNNs). However, the convolution operation is not applicable when the input data is supported on an irregular graph such as with social networks, citation networks, or knowledge graphs. This paper proposes the topology adaptive graph convolutional network (TAGCN), a novel graph convolutional network that generalizes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Water
سال: 2021
ISSN: ['2073-4441']
DOI: https://doi.org/10.3390/w13121681